Set Intersection and Consistency in Constraint Networks
نویسندگان
چکیده
منابع مشابه
Set Intersection and Consistency in Constraint Networks
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consistency properties from properties on set intersection. This approach not only simplifies the understanding of and unifies many existing consistency results, but also directs the study of consistency to that of set inte...
متن کاملLocal Consistency in Parallel Constraint-Satisfaction Networks
One of the key problems facing Artificial Intelligence (AI) is performing efficient inferences over large knowledge bases. Viewed in the context of parallel computation this problem brings forth fundamental research issues such as knowledge representation in parallel environments, problem-decomposition methods, parallelization of classes of AI problems, the role of incremental methods, parallel...
متن کاملArc consistency for general constraint networks : preliminary
Constraint networks are used more and more to solve combinatorial problems in real-life applications. Much activity is concentrated on improving the eeciency of nding a solution in a constraint network (the constraint satisfaction problem, CSP). Particularly, arc consistency caught many researchers' attention, involving the discovery of a large number of algorithms. And, for the last two years,...
متن کاملDual Consistency for Non-binary Constraint Networks
Dual Consistency (DC) was introduced by Lecoutre, Cardon and Vion in [10, 11]. DC is a novel way of handling Path Consistency (PC), with a simpler definition, and new efficient algorithms and approximations. Interestingly, the new definition may be extended to non-binary constraint networks (CNs). DC is thus a way to generalize PC to any CN, while keeping the initial non-binary constraints of t...
متن کاملMin-Max Message Passing and Local Consistency in Constraint Networks
In this paper, we uncover some relationships between local consistency in constraint networks and message passing akin to belief propagation in probabilistic reasoning. We develop a new message passing algorithm, called the min-max message passing (MMMP) algorithm, for unifying the different notions of local consistency in constraint networks. In particular, we study its connection to arc consi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2006
ISSN: 1076-9757
DOI: 10.1613/jair.2058